منابع مشابه
Markovian assignment rules
We analyze dynamic assignment problems where agents successively receive different objects (positions, offices, etc.). A finite set of n vertically differentiated indivisible objects are assigned to n agents who live n periods. At each period, a new agent enters society, and the oldest agent retires, leaving his object to be reassigned. We define independent assignment rules (where the assignme...
متن کاملMarkovian assignment decision process
— A finite-state, discrete-time Markovian décision process, in which, each action in each state is a feasible solution to a state dependent assignment problème is considered, The objective is to maximize the additive rewards realized by the assignments over an infinité time horizon. In the undiscounted case, the average gain per transition and in the discounted case, the discounted total gain r...
متن کاملDHT Broadcast Optimisation with ID Assignment Rules
Decision making in a self-optimising distributed Organic Computing system requires information about the system’s state. Accurate information enables the overall system to respond better to state changes. Distributed systems can use different network protocols, e.g UPD or TCP/IP, to connect the nodes. There is no guarantee that all of these network protocols are able to send broadcasts. If all ...
متن کاملGeneralisations over Corpus-induced Frame Assignment Rules
In this paper we discuss motivations and strategies for generalising over instance-based frame assignment rules that we extract from frame-annotated corpora. Corpus-induced syntax-semantics mapping rules for frame assignment can be used for automatic semantic role labelling of unparsed text, but further, to extract linguistic knowledge for a lexical semantic resource with a general syntax-seman...
متن کاملStress Assignment in Letter to Sound Rules for Speech Synthesis
This paper will discuss how to determine word stress from spelling. Stress assignment is a well-established weak point for many speech synthesizers because stress dependencies cannot be determined locally. It is impossible to determine the stress of a word by looking through a five or six character window, as many speech synthesizers do. Wellknown examples such as degrade / dbgradl, tion and tM...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Choice and Welfare
سال: 2011
ISSN: 0176-1714,1432-217X
DOI: 10.1007/s00355-011-0566-x